Comparing Algorithms for Computing Lower Covers of Implication-closed Sets
نویسنده
چکیده
In this paper, we consider two methods for computing lower cover of elements in closure systems for which we know an implicational basis: intersecting meet-irreducible elements or computing minimal transversals of sets of minimal generators. We provide experimental results on the runtimes for single computations of lower covers and depth-first searches.
منابع مشابه
A Formal Concept Analysis Approach to Data Mining: The QuICL Algorithm for Fast Iceberg Lattice Construction
Association rule mining (ARM) is the task of identifying meaningful implication rules exhibited in a data set. Most research has focused on extracting frequent item (FI) sets and thus fallen short of the overall ARM objective. The FI miners fail to identify the upper covers that are needed to generate a set of association rules whose size can be readily exploited by an end user. An alternative ...
متن کاملMore On λκ−closed sets in generalized topological spaces
In this paper, we introduce λκ−closed sets and study its properties in generalized topological spaces.
متن کاملPROPERTY ANALYSIS OF TRIPLE IMPLICATION METHOD FOR APPROXIMATE REASONING ON ATANASSOVS INTUITIONISTIC FUZZY SETS
Firstly, two kinds of natural distances between intuitionistic fuzzy sets are generated by the classical natural distance between fuzzy sets under a unified framework of residual intuitionistic implication operators. Secondly, the continuity and approximation property of a method for solving intuitionistic fuzzy reasoning are defined. It is proved that the triple implication method for intuitio...
متن کاملApproximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L ⊆ N. For most sets L, the problem of computing L-cycle covers of maximum weight is NP-hard and APX-hard. We devise polynomial-time approximation algorithms for L-cycle covers. More precisely, we present a factor 2 a...
متن کاملDistributed Algorithms for Lifetime of Wireless Sensor Networks Based on Dependencies Among Cover Sets
We present a new set of distributed algorithms for scheduling sensors to enhance the total lifetime of a wireless sensor network. These algorithms are based on constructing minimal cover sets each consisting of one or more sensors which can collectively cover the local targets. Some of the covers are heuristically better than others for a sensor trying to decide its own sense-sleep status. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016